Double-critical graph conjecture for claw-free graphs
نویسندگان
چکیده
منابع مشابه
Double-critical graph conjecture for claw-free graphs
A connected graph G with chromatic number t is double-critical if G − x − y is (t − 2)-colorable for each edge xy ∈ E(G). The complete graphs are the only known examples of double-critical graphs. A long-standing conjecture of Erdős and Lovász from 1966, which is referred to as the Double-critical Graph Conjecture, states that there are no other double-critical graphs, i.e., if a graph G with c...
متن کاملAn approximate version of Hadwiger's conjecture for claw-free graphs
Hadwiger’s conjecture states that every graph with chromatic number χ has a clique minor of size χ. In this paper we prove a weakened version of this conjecture for the class of claw-free graphs (graphs that do not have a vertex with three pairwise nonadjacent neighbors). Our main result is that a claw-free graph with chromatic number χ has a clique minor of size ⌈23χ⌉.
متن کاملThe Path Partition Conjecture is true for claw-free graphs
The detour order of a graph G, denoted by (G), is the order of a longest path in G. The Path Partition Conjecture (PPC) is the following: If G is any graph and (a, b) any pair of positive integers such that (G)= a + b, then the vertex set of G has a partition (A,B) such that (〈A〉) a and (〈B〉) b. We prove that this conjecture is true for the class of claw-free graphs.We also show that to prove t...
متن کاملCritical graphs for subpancyclicity of 3-connected claw-free graphs
Let Fk be the family of graphs G such that all sufficiently large k-connected claw-free graphs which contain no induced copies of G are subpancyclic. We show that for every k≥3 the family F1k is infinite and make the first step toward the complete characterization of the family F3. 2009 Wiley Periodicals, Inc. J Graph Theory 62: 263–278, 2009 Contract grant sponsor: KBN (T. L.); Contract grant ...
متن کاملOn the Erdös-Lovász Tihany Conjecture for Claw-Free Graphs
In 1968, Erdös and Lovász conjectured that for every graph G and all integers s, t ≥ 2 such that s + t − 1 = χ(G) > ω(G), there exists a partition (S, T ) of the vertex set of G such that χ(G|S) ≥ s and χ(G|T ) ≥ t. For general graphs, the only settled cases of the conjecture are when s and t are small. Recently, the conjecture was proved for a few special classes of graphs: graphs with stabili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2017.03.005